Some equivalences between Shannon entropy and Kolmogorov complexity

[24] A. N. Kolmogorov, “On the approximation of distributions of 1271 G. H. Hardy, J. E. Litt lewood, and G. Polya, ZnequaIit ies. New sums of independent summa nds by infinitely divisible distributions,” San/&v& vol. 25, pp. 159-174, 1963. [28] York and London: Cambridge Univ. Press? 1934. D. E. Da kin and C. J. Eliezer, “General ization of Holder’s and (251 A. Renyi, “On the amount of missing information and the Minkows & s inequalities,” Proc. Cambridge Phil. Sot., vol. 64, pp. Neyman-Pearson lemma,” in Research Papers in Statistics, David, 1023-1027, 1968. Ed. New York: W iley, 1966, pp. 281-288. [29] L. Kanal, “Patterns in attem recognition,” IEEE Trans. Znform. [26] G. T. Toussaint, “Some upper bounds on error probability for % multiclass pattern recognition,” IEEE Trans. Comput., C-20, pp. [30] Theory, vol. IT-20, no. pp. 697-722, 1974. C. E. Shannon, “A mathematical theory of communicat ion,” Bell 943-944, 1971. System Tech. J., vol. 27, pp. 379-423, 623-656, 1948.